The complexity of Free-Flood-It on 2×n boards
نویسندگان
چکیده
We consider the complexity of problems related to the combinatorial game Free-Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. Our main result is that computing the length of an optimal sequence is fixed parameter tractable (with the number of colours as a parameter) when restricted to rectangular 2× n boards. We also show that, when the number of colours is unbounded, the problem remains NP-hard on such boards. These results resolve a question of Clifford, Jalsenius, Montanaro and Sach.
منابع مشابه
Flooding games on graphs
We study a discrete di usion process introduced in some combinatorial puzzles called Flood-It, Mad Virus or HoneyBee that can be played online and whose computational complexities have recently been studied. Originally de ned on regular boards, we show that studying their dynamics directly on general graphs is valuable: we synthesize and extend previous results, we show how to solve Flood-It on...
متن کاملNumerical investigation of free surface flood wave and solitary wave using incompressible SPH method
Simulation of free surface flow and sudden wave profile are recognized as the most challenging problem in computational hydraulics. Several Eulerian/Lagrangian approaches and models can be implemented for simulating such phenomena in which the smoothed particle hydrodynamics method (SPH) is categorized as a proper candidate. The incompressible SPH (ISPH) method hires a precise incompressible hy...
متن کامل2-FREE-FLOOD-IT is polynomial
We study a discrete diffusion process introduced in some combinatorial games called FLOODIT and MADVIRUS that can be played online [1, 2] and whose computational complexity has been recently studied [3, 4]. The flooding dynamics used in those games can be defined for any colored graph. It is shown in [5] that studying this dynamics directly on general graph is a valuable approach to understand ...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملThe complexity of flood-filling games on graphs
We consider the complexity of problems related to the combinatorial game Free-Flood-It, in which players aim to make a coloured graph monochromatic with the minimum possible number of flooding operations. Although computing the minimum number of moves required to flood an arbitrary graph is known to be NP-hard, we demonstrate a polynomial time algorithm to compute the minimum number of moves re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 500 شماره
صفحات -
تاریخ انتشار 2013